Plastic shopping bags that get carried away from the side of roads and tangled on cotton plants can end up at cotton gins if not removed before the harvest. Such bags may not only cause problem in the ginning process but might also get embodied in cotton fibers reducing its quality and marketable value. Therefore, it is required to detect, locate, and remove the bags before cotton is harvested. Manually detecting and locating these bags in cotton fields is labor intensive, time-consuming and a costly process. To solve these challenges, we present application of four variants of YOLOv5 (YOLOv5s, YOLOv5m, YOLOv5l and YOLOv5x) for detecting plastic shopping bags using Unmanned Aircraft Systems (UAS)-acquired RGB (Red, Green, and Blue) images. We also show fixed effect model tests of color of plastic bags as well as YOLOv5-variant on average precision (AP), mean average precision (mAP@50) and accuracy. In addition, we also demonstrate the effect of height of plastic bags on the detection accuracy. It was found that color of bags had significant effect (p < 0.001) on accuracy across all the four variants while it did not show any significant effect on the AP with YOLOv5m (p = 0.10) and YOLOv5x (p = 0.35) at 95% confidence level. Similarly, YOLOv5-variant did not show any significant effect on the AP (p = 0.11) and accuracy (p = 0.73) of white bags, but it had significant effects on the AP (p = 0.03) and accuracy (p = 0.02) of brown bags including on the mAP@50 (p = 0.01) and inference speed (p < 0.0001). Additionally, height of plastic bags had significant effect (p < 0.0001) on overall detection accuracy. The findings reported in this paper can be useful in speeding up removal of plastic bags from cotton fields before harvest and thereby reducing the amount of contaminants that end up at cotton gins.

Boll Weevil（Anthonomus Grandis L.）是一种严重的害虫，主要以棉花为食。由于亚热带气候条件，在德克萨斯州的下里奥格兰德山谷等地方，棉花植物可以全年生长，因此，收获期间上一个季节的剩下的种子可以在玉米中的旋转中继续生长（Zea Mays L.）和高粱（高粱双色L.）。这些野性或志愿棉花（VC）植物到达Pinhead平方阶段（5-6叶阶段）可以充当Boll Weevil Pest的宿主。得克萨斯州的鲍尔象鼻虫根除计划（TBWEP）雇用人们在道路或田野侧面生长的风险投资和消除旋转作物的田间生长，但在田野中生长的植物仍未被发现。在本文中，我们证明了基于您的计算机视觉（CV）算法的应用，仅在三个不同的生长阶段（V3，V6）（V3，V6）中检测出在玉米场中生长的VC植物，以检测在玉米场中生长的VC植物的应用。使用无人飞机系统（UAS）遥感图像。使用Yolov5（S，M，L和X）的所有四个变体，并根据分类精度，平均平均精度（MAP）和F1得分进行比较。发现Yolov5s可以在玉米的V6阶段检测到最大分类精度为98％，地图为96.3％，而Yolov5s和Yolov5m的地图为96.3％，而Yolov5m的分类精度为85％，Yolov5m和Yolov5m的分类准确性最小，而Yolov5L的分类精度最少。在VT阶段，在尺寸416 x 416像素的图像上为86.5％。开发的CV算法有可能有效地检测和定位在玉米场中间生长的VC植物，并加快TBWEP的管理方面。

为了控制棉花场中的鲍尔象鼻虫（Anthonomus Grandis L.）害虫重新感染，目前的志愿棉花（VC）（VC）（gossypium hirsutum L.）植物检测玉米（Zea Mays L.）和Sorghum等旋转作物中的植物检测（高粱双色L.）涉及在田野边缘的手动田地侦察。这导致许多风险植物在田野中间生长仍未被发现，并继续与玉米和高粱并肩生长。当他们到达Pinhead平方阶段（5-6片叶子）时，它们可以充当鲍尔维尔虫害的宿主。因此，需要检测，定位，然后精确地用化学物质进行斑点。在本文中，我们介绍了Yolov5M在放射线和伽马校正的低分辨率（1.2兆像素）的多光谱图像中的应用，以检测和定位在康沃尔场的流苏中间（VT）生长阶段生长的VC植物。我们的结果表明，可以以平均平均精度（地图）为79％，分类精度为78％，大小为1207 x 923像素的分类精度为78％，平均推理速度在NVIDIA上的平均推理速度接近47帧（FPS） NVIDIA JETSON TX2 GPU上的Tesla P100 GPU-16GB和0.4 fps。我们还证明了基于开发的计算机视觉（CV）算法的定制无人飞机系统（UAS）的应用应用程序应用程序，以及如何将其用于近乎实时检测和缓解玉米领域中VC植物的近乎实时检测和缓解为了有效地管理鲍尔象鼻虫害虫。

自1800年代后期从墨西哥进入美国以来，棉花象鼻虫是Anthonomus Grandis Boheman是美国棉花行业的严重害虫，其损失超过160亿美元。这种害虫几乎被根除了。但是，得克萨斯州南部仍然面临这个问题，由于其亚热带气候可以全年生长，因此每年始终容易恢复有害生物。一旦到达销售虫（玉米），一旦它们到达销售虫的植物，志愿棉花（VC）植物一旦到达销子，可以作为这些害虫的宿主，一旦它们到达销钉头阶段（5-6叶阶段），因此需要检测到，位于，位于，位置，并被摧毁或喷涂。在本文中，我们介绍了一项研究，用于使用Yolov3在无人飞机系统（UAS）收集的三个频段航空图像上检测玉米田中的VC植物。本文的两倍目标是：（i）确定Yolov3是否可以使用UAS和（II）收集的RGB（红色，绿色和蓝色）在玉米场中进行VC检测来研究行为基于平均精度（AP），平均平均精度（MAP）和95％的95％的图像（320 x 320，s1; 416 x 416，s2; 416 x 416，s2;和512 x 512，s3像素）的图像上的yolov3的图像。信心水平。在三个量表之间，MAP没有显着差异，而S1和S3之间的AP存在显着差异（P = 0.04），S2和S3（P = 0.02）。 S2和S3之间的F1分数也存在显着差异（P = 0.02）。在所有三个量表上，MAP缺乏显着差异表明，训练有素的Yolov3模型可用于基于计算机视觉的远程试验的航空应用系统（RPAA），以实时实时实时进行VC检测和喷雾应用。

This paper proposes a question-answering system that can answer questions whose supporting evidence is spread over multiple (potentially long) documents. The system, called Visconde, uses a three-step pipeline to perform the task: decompose, retrieve, and aggregate. The first step decomposes the question into simpler questions using a few-shot large language model (LLM). Then, a state-of-the-art search engine is used to retrieve candidate passages from a large collection for each decomposed question. In the final step, we use the LLM in a few-shot setting to aggregate the contents of the passages into the final answer. The system is evaluated on three datasets: IIRC, Qasper, and StrategyQA. Results suggest that current retrievers are the main bottleneck and that readers are already performing at the human level as long as relevant passages are provided. The system is also shown to be more effective when the model is induced to give explanations before answering a question. Code is available at \url{https://github.com/neuralmind-ai/visconde}.

A systematic review on machine-learning strategies for improving generalizability (cross-subjects and cross-sessions) electroencephalography (EEG) based in emotion classification was realized. In this context, the non-stationarity of EEG signals is a critical issue and can lead to the Dataset Shift problem. Several architectures and methods have been proposed to address this issue, mainly based on transfer learning methods. 418 papers were retrieved from the Scopus, IEEE Xplore and PubMed databases through a search query focusing on modern machine learning techniques for generalization in EEG-based emotion assessment. Among these papers, 75 were found eligible based on their relevance to the problem. Studies lacking a specific cross-subject and cross-session validation strategy and making use of other biosignals as support were excluded. On the basis of the selected papers' analysis, a taxonomy of the studies employing Machine Learning (ML) methods was proposed, together with a brief discussion on the different ML approaches involved. The studies with the best results in terms of average classification accuracy were identified, supporting that transfer learning methods seem to perform better than other approaches. A discussion is proposed on the impact of (i) the emotion theoretical models and (ii) psychological screening of the experimental sample on the classifier performances.

Autonomous vehicles are suited for continuous area patrolling problems. However, finding an optimal patrolling strategy can be challenging for many reasons. Firstly, patrolling environments are often complex and can include unknown and evolving environmental factors. Secondly, autonomous vehicles can have failures or hardware constraints such as limited battery lives. Importantly, patrolling large areas often requires multiple agents that need to collectively coordinate their actions. In this work, we consider these limitations and propose an approach based on a distributed, model-free deep reinforcement learning based multi-agent patrolling strategy. In this approach, agents make decisions locally based on their own environmental observations and on shared information. In addition, agents are trained to automatically recharge themselves when required to support continuous collective patrolling. A homogeneous multi-agent architecture is proposed, where all patrolling agents have an identical policy. This architecture provides a robust patrolling system that can tolerate agent failures and allow supplementary agents to be added to replace failed agents or to increase the overall patrol performance. This performance is validated through experiments from multiple perspectives, including the overall patrol performance, the efficiency of the battery recharging strategy, the overall robustness of the system, and the agents' ability to adapt to environment dynamics.

Continual Learning, also known as Lifelong or Incremental Learning, has recently gained renewed interest among the Artificial Intelligence research community. Recent research efforts have quickly led to the design of novel algorithms able to reduce the impact of the catastrophic forgetting phenomenon in deep neural networks. Due to this surge of interest in the field, many competitions have been held in recent years, as they are an excellent opportunity to stimulate research in promising directions. This paper summarizes the ideas, design choices, rules, and results of the challenge held at the 3rd Continual Learning in Computer Vision (CLVision) Workshop at CVPR 2022. The focus of this competition is the complex continual object detection task, which is still underexplored in literature compared to classification tasks. The challenge is based on the challenge version of the novel EgoObjects dataset, a large-scale egocentric object dataset explicitly designed to benchmark continual learning algorithms for egocentric category-/instance-level object understanding, which covers more than 1k unique main objects and 250+ categories in around 100k video frames.

Bi-encoders and cross-encoders are widely used in many state-of-the-art retrieval pipelines. In this work we study the generalization ability of these two types of architectures on a wide range of parameter count on both in-domain and out-of-domain scenarios. We find that the number of parameters and early query-document interactions of cross-encoders play a significant role in the generalization ability of retrieval models. Our experiments show that increasing model size results in marginal gains on in-domain test sets, but much larger gains in new domains never seen during fine-tuning. Furthermore, we show that cross-encoders largely outperform bi-encoders of similar size in several tasks. In the BEIR benchmark, our largest cross-encoder surpasses a state-of-the-art bi-encoder by more than 4 average points. Finally, we show that using bi-encoders as first-stage retrievers provides no gains in comparison to a simpler retriever such as BM25 on out-of-domain tasks. The code is available at https://github.com/guilhermemr04/scaling-zero-shot-retrieval.git

Humans form mental images of 3D scenes to support counterfactual imagination, planning, and motor control. Our abilities to predict the appearance and affordance of the scene from previously unobserved viewpoints aid us in performing manipulation tasks (e.g., 6-DoF kitting) with a level of ease that is currently out of reach for existing robot learning frameworks. In this work, we aim to build artificial systems that can analogously plan actions on top of imagined images. To this end, we introduce Mental Imagery for Robotic Affordances (MIRA), an action reasoning framework that optimizes actions with novel-view synthesis and affordance prediction in the loop. Given a set of 2D RGB images, MIRA builds a consistent 3D scene representation, through which we synthesize novel orthographic views amenable to pixel-wise affordances prediction for action optimization. We illustrate how this optimization process enables us to generalize to unseen out-of-plane rotations for 6-DoF robotic manipulation tasks given a limited number of demonstrations, paving the way toward machines that autonomously learn to understand the world around them for planning actions.